Computational Complexity of Attribute Value Grammar

نویسندگان

  • Patrick Blackburn
  • Edith Spaan
  • Patrick
  • Blackburn
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Attribute Grammar Based Framework for Machine Dependent Computational Optimizations of Media Processing Algorithms

Media processing algorithms are typically computation intensive, and in complexity constrained environments, nd-ing the most computational eecient algorithm is critical. In this paper, we present an attribute grammar based framework , which captures the computational complexity of an algorithm in a machine dependent manner. Using this formalism , computational optimality can be deened; a media ...

متن کامل

Grammatical approaches to design

A grammar is a definition of a language written in a transformational form. To the extent that design requirements and designed artifacts can be represented by some language, and to the extent that design is a transformation from function to form, grammars may facilitate the development of theories and methods for design. Furthermore, the computational complexity of various grammatical formalis...

متن کامل

An Attribute Grammar Based Framework for Machine-dependent Computational Optimization of Media Processing Algorithms

Media processing algorithms are typically computationally intensive, and in complexity constrained environments, finding the most computationally efficient algorithm is critical. In this paper, we present an attribute grammar based framework which captures the computational complexity Using this formalism, a media processing algorithm can be optimally and automatically tuned to a particular mac...

متن کامل

On Attribute Grammars Without Atribute Synthesis

We characterize precisely the power of attribute grammars when all functions are identities (such attribute grammars are known to simulate functionless logic programs). In the general case, the problem of deciding whether a given grammar generates a given string is complete for exponential time. Even in the absence of recursion, the problem is complete for polynomial space. In grammars with bou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992